public class Han {
private int n = 4;
private char a = 'a';
private char b = 'b';
private char c = 'c';
public static void main(String[] args) {
Han towerOfHanoi = new Han();
System.out.println("开始" + towerOfHanoi.n);
towerOfHanoi.hanoi(towerOfHanoi.n, towerOfHanoi.a, towerOfHanoi.b,
towerOfHanoi.c);
System.out.println("结束" + towerOfHanoi.n);
}
private void hanoi(int n, char a, char b, char c) {
System.out.println("hanoi: " + "n: " + n + " a: " + a + " b: " + b
+ " c: " + c);
if (n > 0) {
this.hanoi(n - 1, a, c, b);
System.out.println("移动第" + n + "个," + a + "->" + c);
this.hanoi(n - 1, b, a, c);
}
}
}
Java实现汉诺塔
最新推荐文章于 2023-09-17 11:42:39 发布